Adaptive Protocols for Interactive Communication

How much adversarial noise can protocols for interactive communication tolerate? This question was examined by Braverman and Rao (IEEE Trans. Inf. Theory, 2014) for the case of "robust" protocols, where each party sends messages only in fixed and predetermined rounds. We consider a new class of non-robust protocols for Interactive Communication, which we call adaptive protocols. Such protocols adapt structurally to the noise induced by the channel in the sense that both the order of speaking, and the length of the protocol may vary depending on observed noise. We define models that capture adaptive protocols and study upper and lower bounds on the permissible noise rate in these models. When the length of the protocol may adaptively change according to the noise, we demonstrate a protocol that tolerates noise rates up to $1/3$. When the order of speaking may adaptively change as well, we demonstrate a protocol that tolerates noise rates up to $2/3$. Hence, adaptivity circumvents an impossibility result of $1/4$ on the fraction of tolerable noise (Braverman and Rao, 2014).Comment: Content is similar to previous version yet with an improved presentatio

Adoption of database technology: A comparative study

Database now a days,  has become an essential part for keeping any records secured and privatized In earlier we had least databases with unique features with their own. But as the era rises on, numerous databases came into existence. Among those Microsoft SQL server versions and Oracle database became the best but on the counterpart they have a war among themselves too. Each has some unique features and drawbacks. Hence, this white paper discusses that which database server Oracle or Microsoft SQL server is better in different aspects. It studies the working and response of both the databases in different realms. This paper is divided into four main parts. The first part discusses the security issues of oracle and Microsoft SQL server. The second discusses the comparative cost study which includes administration cost also. Third discusses the platform dependency of each of the database that which is more platform supportive, next highlights the performance issues in both the databases which includes scalability, reliability and availability of Oracle RAC and Microsoft SQL server. Performance comparison is also represented in tabular form. In each section, comparison between these two databases is done. In last section, it consists conclusion drawn analyzing all the data. Keywords: Security comparison, Cost comparison, Platform dependency, Performance compariso

A study of the cost analysis of various oral antihypertensive drugs available in Indian market

Background: Hypertension is a serious global public health problem. It accounts for 10% of all deaths in India and is the leading non-communicable disease. Recent studies have shown that the prevalence of hypertension is 25% in urban and 10% in rural people in India. It exerts a substantial public health burden on cardiovascular health status and health care systems in India. Antihypertensive treatment effectively reduces hypertension related morbidity and mortality. The cost of medications has always been a barrier to effective treatment. The increasing prevalence of hypertension requires use of cost effective treatment for the effective management of the disease.Methods: Cost of a particular drug (cost per 10 tablets) in the same strength and dosage forms being manufactured by different companies was obtained from Current Index of Medical Specialties, Jan‑April 2019 and “Indian Drug Review” (IDR) September 2018. Difference between the maximum and minimum cost of the same drug manufactured by different pharmaceutical companies was calculated and percentage cost variation was calculated.Results: The prices of a total of 24 drugs (15 single and 9 combination preparations), available in 59 different formulations were analysed. These 62 formulations are manufactured by different pharmaceutical companies.Conclusions: The average percentage price variation of different brands of the same oral antihypertensive drug manufactured in India is very wide. The appraisal and management of marketing drugs should be directed toward maximizing the benefits of therapy and minimizing negative personal and economic consequences

Study of subsynchronous resonance and its countermeasure using static VAR compensator

This project includes the study of Subsynchronous resonance (SSR) phenomenon which occurs in a power system having series capacitor compensated transmission line. Static VAR compensators can be used to damp SSR oscillations besides controlling the system voltage. The First IEEE benchmark model and eigenvalue techniques are applied in the project to study the behavior of turbo-generator connected to the series compensated transmission line

Cost analysis of various topical eye preparations currently available in Indian market

Background: topical eye preparations are very commonly used in India for different eye diseases hence their prices should not be much different in Indian pharmaceutical industry. The common man therefore has to shell out more money with medicine prices spinning out of his reach. Aim of this study was to compare the cost of drugs of the different brand of topical ophthalmic drugs.Methods: cost of various topical eye preparations was compared using “Current Index of Medical Specialties” (CIMS) January-April 2019 and cost variation was recorded. Drugs were categorized into anti-infective and antiseptics, topical corticosteroids, mydriatics, anti-glaucoma drugs, anti-inflammatory and lubricants.Results: That of the 26 drug formulations studied, the percentage cost variation of 10 drug formulations was more than 100%, out of which one formulation of moxifloxacin had more than 1000% variation. Cost ratio of 10 drug formulations were more than two. Moxifloxacin 0.5% eye drops had maximum percentage cost variation of 5610.66% and cost ratio of 57.11, followed by ofloxacin 0.30% eye drops (310.92%, 4.11), timolol 0.50% eye drops (263.64%, 3.64), ciprofloxacin 0.30% eye drops (142.42%, 2.42), tobramycin 0.30% eye drops (120.14%, 2.20).Conclusions: There is a significant variation in the price of various topical eye preparations. As most of the preparations being prescribed on an out-patient basis, which was not covered under most of the insurance program. Out of pocket expenditure adversely affects the drug compliance in the long run. There should be a comprehensive action from policymakers, regulatory authorities, government agencies, doctors, pharmacists, and the general public to solve this issue of cost variation of drugs

Analysis of phlebotomy blood losses in neonates in a tertiary care hospital

Introduction: Blood loss due to laboratory testing is greatest for the most premature neonates with very low birthweight who require many weeks of intensive support and monitoring. Objective: The purpose of this study was tofind out the volume of blood withdrawn for analytical purposes in neonates. Design: Retrospective chart analysisSetting: Neonatal intensive care unit (NICU) of a tertiary care teaching hospital of central India Participants:Neonates admitted to NICU over a period of three months. All medical records of recruited patients were reviewedand amount of blood withdrawn for analytical purposes was recorded. Intervention: None Main OutcomeMeasures: The amount of blood overdrawn per test and blood overdrawn per newborn. Results: A total of 153neonates were admitted to the NICU during the study period. A total of 684 samples were performed, correspondingto 4.47±3.36 (range 1-17) per neonate. The mean volume of blood removed was 9.38 ml ± 8.8 ml per newborn(range 1 -51 ml). The amount of blood withdrawn was inversely proportional to the gestational age and birth weighti.e., neonates less than 32 weeks gestation and those with birth weight <1500 gm had statistically significant morephlebotomy loss (p<0.0001). The amount of blood withdrawn per test was significantly more than required bylaboratory. Conclusion: The volume of blood sampled in our NICU was higher in neonates with low birth weightand lesser gestational age. The amount of blood overdrawn per test was much higher than required by laboratory

New Methods for Indistinguishability Obfuscation: Bootstrapping and Instantiation

Constructing indistinguishability obfuscation (iO) [BGI+01] is a central open question in cryptography. We provide new methods to make progress towards this goal. Our contributions may be summarized as follows: 1. {\textbf Bootstrapping}. In a recent work, Lin and Tessaro [LT17] (LT) show that iO may be constructed using i) Functional Encryption (FE) for polynomials of degree $L$ , ii) Pseudorandom Generators (PRG) with blockwise locality $L$ and polynomial expansion, and iii) Learning With Errors (LWE). Since there exist constructions of FE for quadratic polynomials from standard assumptions on bilinear maps [Lin17, BCFG17], the ideal scenario would be to set $L = 2$, yielding iO from widely believed assumptions. Unfortunately, it was shown soon after [LV17,BBKK17] that PRG with block locality $2$ and the expansion factor required by the LT construction, concretely $\Omega(n\cdot 2^{b(3+\epsilon)})$, where $n$ is the input length and $b$ is the block length, do not exist. In the worst case, these lower bounds rule out 2-block local PRG with stretch $\Omega(n \cdot 2^{b(2+\epsilon)})$. While [LV17,BBKK17] provided strong negative evidence for constructing iO based on bilinear maps, they could not rule out the possibility completely; a tantalizing gap has remained. Given the current state of lower bounds, the existence of 2 block local PRG with expansion factor $\Omega(n\cdot 2^{b(1+\epsilon)})$ remains open, although this stretch does not suffice for the LT bootstrapping, and is hence unclear to be relevant for iO. In this work, we improve the state of affairs as follows. (a) Weakening requirements on PRGs: In this work, we show that the narrow window of expansion factors left open by lower bounds do suffice for iO. We show a new method to construct FE for $NC_1$ from i) FE for degree L polynomials, ii) PRGs of block locality $L$ and expansion factor $\Omega(n\cdot2^{b(2+\epsilon)})$, and iii) LWE (or RLWE). Our method of bootstrapping is completely different from all known methods and does not go via randomizing polynomials. This re-opens the possibility of realizing iO from $2$ block local PRG, SXDH on Bilinear maps and LWE. (b) Broadening class of sufficient PRGs: Our bootstrapping theorem may be instantiated with a broader class of pseudorandom generators than hitherto considered for iO, and may circumvent lower bounds known for the arithmetic degree of iO -sufficient PRGs [LV17,BBKK17]; in particular, these may admit instantiations with arithmetic degree $2$, yielding iO with the additional assumptions of SXDH on Bilinear maps and LWE. In more detail, we may use the following two classes of PRG: i) Non-Boolean PRGs: We may use pseudorandom generators whose inputs and outputs need not be Boolean but may be integers restricted to a small (polynomial) range. Additionally, the outputs are not required to be pseudorandom but must only satisfy a milder indistinguishability property. We tentatively propose initializing these PRGs using the multivariate quadratic assumption (MQ) which has been widely studied in the literature [MI88,Wol05,DY09] and against the general case of which, no efficient attacks are known. We note that our notion of non Boolean PRGs is qualitatively equivalent to the notion of $\Delta$ RGs defined in the concurrent work of Ananth, Jain, Khurana and Sahai [AJKS18] except that $\Delta$ RG are weaker, in that they allow the adversary to win the game with $1/poly$ probability whereas we require that the adversary only wins with standard negligible probability. By relying on the security amplification theorem of [AJKS18] in a black box way, our construction can also make do with the weaker notion of security considered by [AJKS18]. ii) Correlated Noise Generators: We introduce an even weaker class of pseudorandom generators, which we call correlated noise generators (CNG) which may not only be non-Boolean but are required to satisfy an even milder (seeming) indistinguishability property. (c) Assumptions and Efficiency. Our bootstrapping theorems can be based on the hardness of the Learning With Errors problem (LWE) or its ring variant (RLWE) and can compile FE for degree $L$ polynomials directly to FE for $NC_1$. Previous work compiles FE for degree $L$ polynomials to FE for $NC_0$ to FE for $NC_1$ to iO [LV16,Lin17,AS17,GGHRSW13]. 2. Instantiating Primitives. In this work, we provide the first direct candidate of FE for constant degree polynomials from new assumptions on lattices. Our construction is new and does not go via multilinear maps or graded encoding schemes as all previous constructions. In more detail, let $\mathcal{F}$ be the class of circuits with depth $d$ and output length $\ell$. Then, for any $f \in \mathcal{F}$, our scheme achieves ${\sf Time({keygen})} = O\big(poly(\kappa, |f|)\big)$, and {\sf Time({encrypt})} =O(|\vecx|\cdot 2^d \cdot \poly(\kappa)) where $\kappa$ is the security parameter. This suffices to instantiate the bootstrapping step above. Our construction is based on the ring learning with errors assumption (RLWE) as well as new untested assumptions on NTRU rings. We provide a detailed security analysis and discuss why previously known attacks in the context of multilinear maps, especially zeroizing attacks and annihilation attacks, do not appear to apply to our setting. We caution that the assumptions underlying our construction must be subject to rigorous cryptanalysis before any confidence can be gained in their security. However, their significant departure from known multilinear map based constructions make them, we feel, a potentially fruitful new direction to explore. Additionally, being based entirely on lattices, we believe that security against classical attacks will likely imply security against quantum attacks. Note that this feature is not enjoyed by instantiations that make any use of bilinear maps even if secure instances of weak PRGs, as defined by the present work, the follow-up by Lin and Matt [LM18] and the independent work by Ananth, Jain, Khurana and Sahai [AJKS18] are found

Encryption and Secure Transmission of Telemedicinal Image in Watermarking using DWT HAAR Wavelet Algorithm

This is a result paper .In this paper, watermarking using DWT Haar wavelet algorithm is used.In this papera patient brain image which is to be transmitted using telemedicine is encrypted and the records of patient brain condition is hidden along with patients document and is transmitted along the channel which can not be decrypted by any unauthorized section. The main aim of this paper is to hide the patient information along with the image and to encrypt and transmit the data along with images and to protect it from different kind of attacks and noise that mainly take place in channels. The purpose of using watermarking is that watermarking does not influence the diagnosis to be made by reducing the visual clarity of medical images. Watermarking is implemented here using DWT haar wavelet and the process include complete copyright protection. Experimental result show high imperceptibility where there is no noticeable change in the watermarked image and original image and the patients records is also hidden along with the image which is to be transmitted along the channel that cannot be hacked or attacked by any unauthorized section. The robustness of watermarking scheme is analysed by means of performance evaluation of peak signal to noise ratio (PSNR) DOI: 10.17762/ijritcc2321-8169.150516

Ad Hoc Multi-Input Functional Encryption

Consider sources that supply sensitive data to an aggregator. Standard encryption only hides the data from eavesdroppers, but using specialized encryption one can hope to hide the data (to the extent possible) from the aggregator itself. For flexibility and security, we envision schemes that allow sources to supply encrypted data, such that at any point a dynamically-chosen subset of sources can allow an agreed-upon joint function of their data to be computed by the aggregator. A primitive called multi-input functional encryption (MIFE), due to Goldwasser et al. (EUROCRYPT 2014), comes close, but has two main limitations: - it requires trust in a third party, who is able to decrypt all the data, and - it requires function arity to be fixed at setup time and to be equal to the number of parties. To drop these limitations, we introduce a new notion of ad hoc MIFE. In our setting, each source generates its own public key and issues individual, function-specific secret keys to an aggregator. For successful decryption, an aggregator must obtain a separate key from each source whose ciphertext is being computed upon. The aggregator could obtain multiple such secret-keys from a user corresponding to functions of varying arity. For this primitive, we obtain the following results: - We show that standard MIFE for general functions can be bootstrapped to ad hoc MIFE for free, i.e. without making any additional assumption. - We provide a direct construction of ad hoc MIFE for the inner product functionality based on the Learning with Errors (LWE) assumption. This yields the first construction of this natural primitive based on a standard assumption. At a technical level, our results are obtained by combining standard MIFE schemes and two-round secure multiparty computation (MPC) protocols in novel ways highlighting an interesting interplay between MIFE and two-round MPC